Pii: S0010-4485(99)00080-9
نویسندگان
چکیده
Presented in the paper is a tool-path planning algorithm for direction-parallel area milling consisting of three modules: (1) finding the optimal inclination; (2) calculating and storing tool-path elements; and (3) tool-path linking. For the optimal inclination, we suggest an algorithm that selects an inclination by reflecting the shape of the machining area as well as the tool-path interval. We make use of the concept of a monotone chain and the plane-sweep paradigm to calculate the tool-path elements. The concept of a monotone chain brings clarity and tight-time complexity to the proposed algorithm. The tool-path linking problem is modeled as a TPE-Net (tool-path element net) traversing problem. For the two direction-parallel milling topologies, one-way and zigzag, tool-path linking algorithms are proposed. Empirical tests show that the proposed algorithm fulfils its requirements. q 2000 Elsevier Science Ltd. All rights reserved.
منابع مشابه
Smoothing haptic interaction using molecular force calculations
This paper presents a new method for smoothing haptic interaction with molecular force calculations that uses Lennard-Jones forcefield. The gradient of the forcefield is used unaltered when the distance between two atoms is greater than the sum of their van der Waals radii. However, when they are smaller, a hard-surface wall implemented using a spring model is used to repel two atoms. This elim...
متن کاملPii: S0010-4485(99)00084-6
We are dealing with the problem of space layout planning here. We present an architectural conceptual CAD approach. Starting with design specifications in terms of constraints over spaces, a specific enumeration heuristics leads to a complete set of consistent conceptual design solutions named topological solutions. These topological solutions which do not presume any precise definitive dimensi...
متن کاملPii: S0010-4485(98)00080-3
We present a new approach to medial axis transform and offset curve computation. Our algorithm is based on the domain decomposition scheme which reduces a complicated domain into a union of simple subdomains each of which is very easy to handle. This domain decomposition approach gives rise to the decomposition of the corresponding medial axis transform which is regarded as a geometric graph in...
متن کاملPii: S0010-4485(99)00060-3
Presented in the paper is an efficient pair-wise offset algorithm for closed 2D point-sequence curves (PS-curve). A key feature of the proposed algorithm is that all local invalid loops are removed from the input PS-curve before constructing a raw offset-curve, by invoking a pair-wise interference-detection (PWID) test. In the PWID test, each pair of elementary offset segments is tested for int...
متن کاملSeparating topology and geometry in space planning
2 We are here dealing with the problem of space layout planning. We present an architectural conceptual CAD approach. Starting with design specifications in terms of constraints over spaces, a specific enumeration heuristics leads to a complete set of consistent conceptual design solutions named topological solutions. These topological solutions which do not presume any precise definitive dimen...
متن کامل